The Effects of Sampling Kurtosis on Anytime Algorithm Performance

نویسنده

  • Scott Burgess
چکیده

Agent-system and agent-simulator networks encompass complex interactions that are often difficult to model. We use an On-Line Maintenance Agent test bed for analyzing the behavior of Bayesian anytime inference algorithms for influence diagrams. This test bed is used to analyze the performance of a backward simulation algorithm used by the agent for decision making. We show that the kurtosis of sampling acts as a focusing mechanism which may be useful in designing better anytime algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Latin Hypercube Sampling in Bayesian Networks

We propose a scheme for producing Latin hypercube samples that can enhance any of the existing sampling algorithms in Bayesian networks. We test this scheme in combination with the likelihood weighting algorithm and show that it can lead to a significant improvement in the convergence rate. While performance of sampiing algorithms in general depends on the numerical properties of a network, in ...

متن کامل

Threshold Selection for 60 GHz TOA Estimation Based on Skewness and Kurtosis Analysis

Because of the high sampling rate, coherent Time of Arrival (TOA) estimation algorithms are not practical for low cost, low complexity 60 GHz systems. In this paper, energy detect (ED) based non-coherent TOA estimation algorithm is presented. The expected values of the skewness and kurtosis with respect to the signal to noise ratio (SNR) are investigated. It is shown that the ratio of kurtosis ...

متن کامل

Informed Asymptotically Optimal Anytime Search

Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular approximations include graphs and random samples, as respectively used by informed graph-based searches and anytime sampling-based planners. Informed graph-bas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006